Linear cover time is exponentially unlikely

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Cover Time Is Exponentially Unlikely

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C , there exists α=α(D,C ) > 0 such that for any graph G , with n vertices and maximal degree D , the probability that a simple random walk, started anywhere in G , will visit every vertex of G in its first C n steps is at most e−αn ...

متن کامل

Linear cover time for trees is exponentially unlikely

The cover time of a graph is the time it takes for a random walk on it to visit all vertices. This note shows that for any tree on n vertices, the probability that the cover time of the tree is linear in n is exponentially small in n. This is true for any starting vertex.

متن کامل

Exponentially Stable Linear Time-Varying Discrete Behaviors

We study implicit systems of linear time-varying (LTV) difference equations with rational coefficients of arbitrary order and their solution spaces, called discrete LTV-behaviors. The signals are sequences, i.e. functions from the discrete time set of natural numbers into the complex numbers. The difference field of rational functions with complex coefficients gives rise to a noncommutative ske...

متن کامل

Set Cover in Sub-linear Time

We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of m sets over n elements in the query model, we show that sub-linear algorithms derived from existing techniques have almost tight query complexities. On one hand, first we show an adaptation of the streaming algorithm presented in [17] to the sub-linear query model, that returns ...

متن کامل

A linear time algorithm for Shortest Cyclic Cover of Strings

Merging words according to their overlap yields a superstring. This basic operation allows to infer long strings from a collection of short pieces, as in genome assembly. To capture a maximum of overlaps, the goal is to infer the shortest superstring of a set of input words. The Shortest Cyclic Cover of Strings (SCCS) problem asks, instead of a single linear superstring, for a set of cyclic str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2011

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-011-0403-2